翻訳と辞書 Words near each other ・ Generalizability theory ・ Generalization ・ Generalization (disambiguation) ・ Generalization (learning) ・ Generalization error ・ Generalizations of Fibonacci numbers ・ Generalizations of Pauli matrices ・ Generalizations of the derivative ・ Generalized additive model ・ Generalized additive model for location, scale and shape ・ Generalized algebraic data type ・ Generalized anxiety disorder ・ Generalized Anxiety Disorder 7 ・ Generalized Appell polynomials ・ Generalized arithmetic progression ・ Generalized assignment problem ・ Generalized audit software ・ Generalized Automation Language ・ Generalized beta distribution ・ Generalized Büchi automaton ・ Generalized canonical correlation ・ Generalized chi-squared distribution ・ Generalized Clifford algebra ・ Generalized complex structure ・ Generalized context-free grammar ・ Generalized continued fraction ・ Generalized coordinates ・ Generalized dihedral group ・ Generalized Dirichlet distribution ・ Generalized distributive law Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized assignment problem ： ウィキペディア英語版 Generalized assignment problem In applied mathematics, the maximum generalized assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both tasks and agents have a size. Moreover, the size of each task might vary from one agent to the other. This problem in its most general form is as follows:- There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost and profit that may vary depending on the agent-task assignment. Moreover, each agent has a budget and the sum of the costs of tasks assigned to it cannot exceed this budget. It is required to find an assignment in which all agents do not exceed their budget and total profit of the assignment is maximized. ==In Special cases== In the special case in which all the agents' budgets and all tasks' costs are equal to 1, this problem reduces to the assignment problem. When the costs and profits of all agents-task assignment are equal, this problem reduces to the multiple knapsack problem. If there is a single agent, then, this problem reduces to the Knapsack problem. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized assignment problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.